Algebraic certification of numerical algorithms computing Lagrange resolvents

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lagrange Resolvents

This paper is devoted to a sharp investigation of the notion of Lagrange's resolvent and his connections with Galois Theory.

متن کامل

Kummer, Eisenstein, Computing Gauss Sums as Lagrange Resolvents

In fact, [Eisenstein 1850] evaluated cubes and fourth powers of Gauss sums attached to cubic and quartic characters to prove the corresponding reciprocity laws. One essential point is the p-adic approximation of Gauss sums by [Kummer 1847], generalized in [Stickelberger 1890]. Since the rings of algebraic integers generated by third or fourth roots of unity have class number one and finitely-ma...

متن کامل

Efficient computation of square-free Lagrange resolvents

We propose a general frame to compute efficiently in the invariant algebra k[X1, . . . , Xn] , whereH is a finite subgroup of the general linear groupGLn(k). The classical Noether normalization of this Cohen-Macaulay algebra takes a natural form when expressed with adequate data structures, based on evaluation rather than writing. This allows to compute more efficiently its multiplication tenso...

متن کامل

Algebraic and Numerical Algorithms

Arithmetic manipulation with matrices and polynomials is a common subject for algebraic (or symbolic) and numerical computing. Typical computational problems in these areas include the solution of a polynomial equation and linear and polynomial systems of equations, univariate and multivariate polynomial evaluation, interpolation, factorization and decompositions, rational interpolation, comput...

متن کامل

Some Recent Algebraic/numerical Algorithms

Combination of algebraic and numerical techniques for improving the computations in algebra and geometry is a popular research topic of growing interest. We survey some recent progress that we made in this area, in particular , regarding polynomial roottnding, the solution of a polynomial system of equations, the computation of an approximate greatest common divisor of two polynomials as well a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra and Its Applications

سال: 2018

ISSN: 0219-4988,1793-6829

DOI: 10.1142/s021949881850007x